How to search in historyCHAZELLE, B.Information and control. 1985, Vol 64, Num 1-3, pp 77-99, issn 0019-9958Article

A balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristicsNAKAMURA, Y; ABE, S; OHSAWA, Y et al.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 4, pp 682-694, issn 1041-4347Article

Program optimization using indexed and recursive data structuresLIU, Yanhong A; STOLLER, Scott D.ACM SIGPLAN notices. 2002, Vol 37, Num 3, pp 108-118, issn 1523-2867Conference Paper

Quadtree building algorithms on an SIMD hypercubeIBARRA, O. H; MYUNG HEE KIM.Journal of parallel and distributed computing (Print). 1993, Vol 18, Num 1, pp 71-76, issn 0743-7315Article

The power of parallel projectionVAN KREVELD, M.Information processing letters. 1993, Vol 46, Num 4, pp 185-191, issn 0020-0190Article

Analysis of Grid file algorithmsREGNIER, M.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 2, pp 335-357, issn 0006-3835Article

A theory of sequentialityBUCCIARELLI, A; EHRHARD, T.Theoretical computer science. 1993, Vol 113, Num 2, pp 273-291, issn 0304-3975Article

On the randomized construction of the Delaunay treeBOISSONNAT, J.-D; TEILLAUD, M.Theoretical computer science. 1993, Vol 112, Num 2, pp 339-354, issn 0304-3975Article

A data structure for dynamic treesSLEATOR, D. D; TARJAN, R. E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 362-391, issn 0022-0000Article

Algorithms and data structurese (Waterloo ON, 15-17 August 2005)Dehne, Frank; Lopez-Ortiz, Alejandro; Sack, Jörg-Rüdiger et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28101-0, XIV, 446 p, isbn 3-540-28101-0Conference Proceedings

Data structure architectures = Architectures de structure de donnéesGILOI, W. K; HEGER, D.RT. Regelungstechnik. 1985, Vol 33, Num 1, pp 25-31, issn 0340-434XArticle

Log-logarithmic worst-case range queries are possible in space Θ (N)WILLARD, D. E.Information processing letters. 1983, Vol 17, Num 2, pp 81-84, issn 0020-0190Article

Searching in metric spaces by spatial approximationNAVARRO, Gonzalo.The VLDB journal. 2002, Vol 11, Num 1, pp 28-46, issn 1066-8888Article

Efficient data structures for deduction systemsOHLBACH, H. J.Lecture notes in computer science. 1997, Vol 1341, pp 1-2, issn 0302-9743, isbn 3-540-63792-3Conference Paper

Efficiently planning compliant motion in the planeFRIEDMAN, J; HERSHBERGER, J; SNOEYINK, J et al.SIAM journal on computing (Print). 1996, Vol 25, Num 3, pp 562-599, issn 0097-5397Article

Interpolation-based index maintenanceBURKHARD, W. A.BIT (Nordisk Tidskrift for Informationsbehandling). 1983, Vol 23, Num 3, pp 274-294, issn 0006-3835Article

A paradigm for the design of parallel algorithms with applicationsRAMAKRISHNAN, I. V; BROWNE, J. P.IEEE transactions on software engineering. 1983, Vol 9, Num 4, pp 411-415, issn 0098-5589Article

WADS 2003 : algorithms and data structures (Ottawa ON, 30 July - 1 August 2003)Dehne, Frank; Sack, Jörg-Rüdiger; Smid, Michiel et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40545-3, XII, 522 p, isbn 3-540-40545-3Conference Proceedings

Test sequence generation from the protocol data portion based on the Selecting Chinese Postman algorithmCHEN, W.-H.Information processing letters. 1998, Vol 65, Num 5, pp 261-268, issn 0020-0190Article

Ray shooting amidst spheres in three dimensions and related problemsMOHABAN, S; SHARIR, M.SIAM journal on computing (Print). 1997, Vol 26, Num 3, pp 654-674, issn 0097-5397Article

A common information structure for broadcast applicationsBOETJE, J; COLLIER, D.SMPTE journal (1976). 1997, Vol 106, Num 10, pp 682-697, issn 0036-1682Conference Paper

Circular programs and self-referential structuresALLISON, L.Software, practice & experience. 1989, Vol 19, Num 2, pp 99-109, issn 0038-0644Article

Constraint relation implementation for finite element analysis from an element basisSAN-CHENG CHANG; TSUNG-WU LIN.Advances in engineering software (1978). 1988, Vol 10, Num 4, pp 191-194, issn 0141-1195Article

A pointer-free data structure for merging heaps and min-max heapsGAMBOSI, G; NARDELLI, E; TALAMO, M et al.Theoretical computer science. 1991, Vol 84, Num 1, pp 107-126, issn 0304-3975, 20 p.Conference Paper

On robustness of B-treesFUJIMURA, K; JALOTE, P.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 3, pp 530-534, issn 1041-4347Article